Computational Methods for the Fourier Analysis of Sparse High-Dimensional Functions
نویسندگان
چکیده
A straightforward discretisation of high-dimensional problems often leads to a curse of dimensions and thus the use of sparsity has become a popular tool. Efficient algorithms like the fast Fourier transform (FFT) have to be customised to these thinner discretisations and we focus on two major topics regarding the Fourier analysis of high-dimensional functions: We present stable and effective algorithms for the fast evaluation and reconstruction of multivariate trigonometric polynomials with frequencies supported on an index set I ⊂ Z.
منابع مشابه
Time-Discontinuous Finite Element Analysis of Two-Dimensional Elastodynamic Problems using Complex Fourier Shape Functions
This paper reformulates a time-discontinuous finite element method (TD-FEM) based on a new class of shape functions, called complex Fourier hereafter, for solving two-dimensional elastodynamic problems. These shape functions, which are derived from their corresponding radial basis functions, have some advantages such as the satisfaction of exponential and trigonometric function fields in comple...
متن کاملAn Enhanced Finite Element method for Two Dimensional Linear Viscoelasticity using Complex Fourier Elements
In this paper, the finite element analysis of two-dimensional linear viscoelastic problems is performed using quadrilateral complex Fourier elements and, the results are compared with those obtained by quadrilateral classic Lagrange elements. Complex Fourier shape functions contain a shape parameter which is a constant unknown parameter adopted to enhance approximation’s accuracy. Since the iso...
متن کاملMammalian Eye Gene Expression Using Support Vector Regression to Evaluate a Strategy for Detecting Human Eye Disease
Background and purpose: Machine learning is a class of modern and strong tools that can solve many important problems that nowadays humans may be faced with. Support vector regression (SVR) is a way to build a regression model which is an incredible member of the machine learning family. SVR has been proven to be an effective tool in real-value function estimation. As a supervised-learning appr...
متن کاملFast discrete algorithms for sparse Fourier expansions of high dimensional functions
We develop a fast discrete algorithm for computing the sparse Fourier expansion of a function of d dimension. For this purpose, we introduce a sparse multiscale Lagrange interpolation method for the function. Using this interpolation method, we then design a quadrature scheme for evaluating the Fourier coefficients of the sparse Fourier expansion. This leads to a fast discrete algorithm for com...
متن کاملFast Reconstruction of SAR Images with Phase Error Using Sparse Representation
In the past years, a number of algorithms have been introduced for synthesis aperture radar (SAR) imaging. However, they all suffer from the same problem: The data size to process is considerably large. In recent years, compressive sensing and sparse representation of the signal in SAR has gained a significant research interest. This method offers the advantage of reducing the sampling rate, bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014